@InProceedings{FaccinVernierCombTele:2018:StGrIn,
               author = "Faccin Vernier, Eduardo and Comba, Joao and Telea, Alexandru C.",
          affiliation = "{UFRGS and RUG} and UFRGS and RUG",
                title = "A Stable Greedy Insertion Treemap Algorithm for Software Evolution 
                         Visualization",
            booktitle = "Proceedings...",
                 year = "2018",
               editor = "Ross, Arun and Gastal, Eduardo S. L. and Jorge, Joaquim A. and 
                         Queiroz, Ricardo L. de and Minetto, Rodrigo and Sarkar, Sudeep and 
                         Papa, Jo{\~a}o Paulo and Oliveira, Manuel M. and Arbel{\'a}ez, 
                         Pablo and Mery, Domingo and Oliveira, Maria Cristina Ferreira de 
                         and Spina, Thiago Vallin and Mendes, Caroline Mazetto and Costa, 
                         Henrique S{\'e}rgio Gutierrez and Mejail, Marta Estela and Geus, 
                         Klaus de and Scheer, Sergio",
         organization = "Conference on Graphics, Patterns and Images, 31. (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "Treemap, Dynamic.",
             abstract = "Computing treemap layouts for time-dependent (dynamic) trees is an 
                         open problem in information visualization. In particular, the 
                         constraints of spatial quality (cell aspect ratio) and stability 
                         (small treemap changes mandated by given tree-data changes) are 
                         hard to satisfy simultaneously. Most existing treemap methods 
                         focus on spatial quality, but are not inherently designed to 
                         address stability. We propose here a new treemapping method that 
                         aims to jointly optimize both these constraints. Our method is 
                         simple to implement, generic (handles any types of dynamic 
                         hierarchies), and fast. We compare our method with 14 state of the 
                         art treemaping algorithms using four quality metrics, over 28 
                         dynamic hierarchies extracted from evolving software codebases. 
                         The comparison shows that our proposal jointly optimizes spatial 
                         quality and stability better than existing methods.",
  conference-location = "Foz do Igua{\c{c}}u, PR, Brazil",
      conference-year = "29 Oct.-1 Nov. 2018",
                  doi = "10.1109/SIBGRAPI.2018.00027",
                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2018.00027",
             language = "en",
                  ibi = "8JMKD3MGPAW/3RNAQPP",
                  url = "http://urlib.net/ibi/8JMKD3MGPAW/3RNAQPP",
           targetfile = "Paper ID 23.pdf",
        urlaccessdate = "2024, Apr. 27"
}